Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
531	Combinatorial Reasoning in Information Theory Noga Alon∗ Abstract Combinatorial techniques play a crucial role in the investigation of problems in Information Theory. We describe a few representative examples, focusing Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2009-09-22 15:09:58 Graph coloring NP-complete problems Cartesian product of graphs Lovász number Graph theory Induced path Degeneracy
532	An Efficient Spectral Bound for Link Vulnerability Assessment in Large-scale Networks Thang N. Dinh, Yilin Shen, and My T. Thai Dept. of Comp. & Info. Sci. & Eng. University of Florida Gainesville, FL, US, 32611 Add to Reading List Source URL: www.cise.ufl.edu Language: English - Date: 2012-09-04 09:52:44 Algebraic graph theory Spectral theory Matrix theory NP-complete problems Graph partition Eigenvalues and eigenvectors Connectivity Spectrum Eigenvalue algorithm Algebra Mathematics Linear algebra
533	Elect. Comm. in Probab[removed]–90 ELECTRONIC COMMUNICATIONS in PROBABILITY Add to Reading List Source URL: www.emis.de Language: English - Date: 2011-12-25 21:18:15 Circle packing theorem Tree NP-complete problems Planar separator theorem Line graph Graph theory Mathematics Planar graphs
534	A Practical Parallel Algorithm for Cycle Detection in Partitioned Digraphs David A. Bader Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2009-02-15 11:12:53 Planar graph Tree Vertex NP-complete problems Graph coloring Line graph Pseudoforest Graph theory Graph operations Graph
535	Bipancyclic Properties of Faulty Hypercubes Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-28 19:13:12 NP-complete problems Hypercube graph Hamiltonian path Graph Tree Graph theory Theoretical computer science Mathematics
536	10 TH IEEE I NTERNATIONAL C ONFERERNCE ON C OMPUTER V ISION (ICCV 2005), O CTOBER 17–20, 2005, B EIJING , C HINA . Finding Tree Structures by Grouping Symmetries Hiroshi Ishikawa† [removed] † Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2008-01-16 15:03:23 NP-complete problems Combinatorial optimization Spanning tree Steiner tree problem Graph Tree Connectivity Shortest path problem Matching Graph theory Mathematics Theoretical computer science
537	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory
538	An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritaoglu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed] Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2006-07-06 10:53:25 NP-complete problems Cubes Hypercube Parallel computing Shortest path problem Heuristic Graph partition Algorithm Mathematics Theoretical computer science Computational complexity theory
539	GPS: A Graph Processing System⇤ Semih Salihoglu and Jennifer Widom Stanford University {semih,widom}@cs.stanford.edu Abstract Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2013-06-18 18:35:13 NP-complete problems Graph partition Graph Connected component Graph coloring Edge coloring Graph theory Theoretical computer science Mathematics
540	0 DISCRETli MATHEMATICS5[removed]North-Holland Publishing Company ACYCLIC ORIENTATIONS OF GRAPHS* Richard P. STANLEY Departmentof Mathematics,Universityof California, Add to Reading List Source URL: www-math.mit.edu Language: English - Date: 2007-08-09 20:43:14 Graph coloring NP-complete problems Chromatic polynomial Polynomials Directed acyclic graph Directed graph Graph Tutte polynomial Covering graph Graph theory Mathematics Theoretical computer science

UPDATE